Optimal Energy Management for Energy Harvesting Transmitter and Receiver with Helper

We study energy harvesting (EH) transmitter and receiver, where the receiver decodes data using the harvested energy from the nature and from an independent EH node, named helper. Helper cooperates with the receiver by transferring its harvested energy to the receiver over an orthogonal fading channel. We study an offline optimal power management policy to maximize the reliable information rate. The harvested energy in all three nodes are assumed to be known. We consider four different scenarios; First, for the case that both transmitter and the receiver have batteries, we show that the optimal policy is transferring the helper harvested energy to the receiver, immediately. Next, for the case of non-battery receiver and full power transmitter, we model a virtual EH receiver with minimum energy constraint to achieve an optimal policy. Then, we consider a non-battery EH receiver and EH transmitter with battery. Finally, we derive optimal power management wherein neither the transmitter nor the receiver have batteries. We propose three iterative algorithms to compute optimal energy management policies. Numerical results are presented to corroborate the advantage of employing the helper.Comment: It is a conference paper with 5 pages and one figure, submitted to ISITA201

Compressive Sensing and Recovery of Structured Sparse Signals

In the recent years, numerous disciplines including telecommunications, medical imaging, computational biology, and neuroscience benefited from increasing applications of high dimensional datasets. This calls for efficient ways of data capturing and data processing. Compressive sensing (CS), which is introduced as an efficient sampling (data capturing) method, is addressing this need. It is well-known that the signals, which belong to an ambient high-dimensional space, have much smaller dimensionality in an appropriate domain. CS taps into this principle and dramatically reduces the number of samples that is required to be captured to avoid any distortion in the information content of the data. This reduction in the required number of samples enables many new applications that were previously infeasible using classical sampling techniques. Most CS-based approaches take advantage of the inherent low-dimensionality in many datasets. They try to determine a sparse representation of the data, in an appropriately chosen basis using only a few significant elements. These approaches make no extra assumptions regarding possible relationships among the significant elements of that basis. In this dissertation, different ways of incorporating the knowledge about such relationships are integrated into the data sampling and the processing schemes. We first consider the recovery of temporally correlated sparse signals and show that using the time correlation model. The recovery performance can be significantly improved. Next, we modify the sampling process of sparse signals to incorporate the signal structure in a more efficient way. In the image processing application, we show that exploiting the structure information in both signal sampling and signal recovery improves the efficiency of the algorithm. In addition, we show that region-of-interest information can be included in the CS sampling and recovery steps to provide a much better quality for the region-of-interest area compared the rest of the image or video. In spectrum sensing applications, CS can dramatically improve the sensing efficiency by facilitating the coordination among spectrum sensors. A cluster-based spectrum sensing with coordination among spectrum sensors is proposed for geographically disperse cognitive radio networks. Further, CS has been exploited in this problem for simultaneous sensing and localization. Having access to this information dramatically facilitates the implementation of advanced communication technologies as required by 5G communication networks

Missing Spectrum-Data Recovery in Cognitive Radio Networks Using Piecewise Constant Nonnegative Matrix Factorization

In this paper, we propose a missing spectrum data recovery technique for cognitive radio (CR) networks using Nonnegative Matrix Factorization (NMF). It is shown that the spectrum measurements collected from secondary users (SUs) can be factorized as product of a channel gain matrix times an activation matrix. Then, an NMF method with piecewise constant activation coefficients is introduced to analyze the measurements and estimate the missing spectrum data. The proposed optimization problem is solved by a Majorization-Minimization technique. The numerical simulation verifies that the proposed technique is able to accurately estimate the missing spectrum data in the presence of noise and fading.Comment: 6 pages, 6 figures, Accepted for presentation in MILCOM'15 Conferenc

Robust Target Localization Based on Squared Range Iterative Reweighted Least Squares

In this paper, the problem of target localization in the presence of outlying sensors is tackled. This problem is important in practice because in many real-world applications the sensors might report irrelevant data unintentionally or maliciously. The problem is formulated by applying robust statistics techniques on squared range measurements and two different approaches to solve the problem are proposed. The first approach is computationally efficient; however, only the objective convergence is guaranteed theoretically. On the other hand, the whole-sequence convergence of the second approach is established. To enjoy the benefit of both approaches, they are integrated to develop a hybrid algorithm that offers computational efficiency and theoretical guarantees. The algorithms are evaluated for different simulated and real-world scenarios. The numerical results show that the proposed methods meet the Cr'amer-Rao lower bound (CRLB) for a sufficiently large number of measurements. When the number of the measurements is small, the proposed position estimator does not achieve CRLB though it still outperforms several existing localization methods.Comment: 2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS): http://ieeexplore.ieee.org/document/8108770

Stability analysis of network of similar-plants via feedback network

Here, we study a networked control system with similar linear time-invariant plants. Using master stability function method we propose a network optimization method to minimize the feedback network order in the sense Frobenius norm. Then we verify our results with numerical example. We show that this method outperforms the known feedback network optimization methods namely matching condition.Comment: 5 pages; 4 figures; submitted to IEEE Systems Conference 201

Stability Analysis Of Network Of Similar-Plants Via Feedback Network

In this paper, we study a networked control system with similar linear time-invariant plants. Using the master stability function method. We propose a network optimization method to minimize the feedback network order in the sense of the Frobenius norm. Then we verify our results with a numerical example. Additionally, we show that this method outperforms the known feedback network optimization methods namely matching condition

Model-Based Nonuniform Compressive Sampling And Recovery Of Natural Images Utilizing A Wavelet-Domain Universal Hidden Markov Model

In this paper, a novel model-based compressive sampling (CS) technique for natural images is proposed. Our algorithm integrates a universal hidden Markov tree (uHMT) model, which captures the relation among the sparse wavelet coefficients of images, into both sampling and recovery steps of CS. At the sampling step, we employ the uHMT model to devise a nonuniformly sparse measurement matrix ΦuHMT. In contrast to the conventional CS sampling matrices, such as dense Gaussian, Bernoulli or uniformly sparse matrices that are oblivious to the signal model and the correlation among the signal coefficients, the proposed ΦuHMT is designed based on the signal model and samples the coarser wavelet coefficients with higher probabilities and more sparse wavelet coefficients with lower probabilities. At the recovery step, we integrate the uHMT model into two state-of-the-art Bayesian CS recovery schemes. Our simulation results confirm the superiority of our proposed HMT model-based nonuniform compressive sampling and recovery, referred to as uHMT-NCS, over other model-based CS techniques that solely consider the signal model at the recovery step. This paper is distinguished from other model-based CS schemes in that we take a novel approach to simultaneously integrating the signal model into both CS sampling and recovery steps. We show that such integration greatly increases the performance of the CS recovery, which is equivalent to reducing the required number of samples for a given reconstruction quality